Examples of rank 3 product action transitive decompositions

نویسنده

  • Geoffrey Pearce
چکیده

A transitive decomposition is a pair (Γ,P) where Γ is a graph and P is a partition of the arc set of Γ such that there is a subgroup of automorphisms of Γ which leaves P invariant and transitively permutes the parts in P. In an earlier paper we gave a characterisation of G-transitive decompositions where Γ is the graph product Km×Km and G is a rank 3 group of product action type. This characterisation showed that every such decomposition arose from a 2-transitive decomposition of Km via one of two general constructions. Here we use results of Sibley to give an explicit classification of those which arise from 2-transitive edge-decompositions of Km.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Product constructions for transitive decompositions of graphs

A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition is a decomposition which is highly symmetrical, in the sense that the subgraphs are preserved and transitively permuted by a group of automorphisms of the graph. This paper describes some ‘product’ constructions for transitive decompositions of graphs, and shows how these may be used...

متن کامل

Transitive decompositions of graph products: rank 3 grid type

A transitive decomposition is a pair ðG;PÞ where G is a graph and P is a partition of the arc set of G, such that there exists a group of automorphisms of G which leaves P invariant and transitively permutes the parts in P. This paper concerns transitive decompositions where the group is a primitive rank 3 group of ‘grid’ type. The graphs G in this case are either products or Cartesian products...

متن کامل

Transitive decompositions of graphs

A decomposition of a graph is a partition of the edge set. One can also look at partitions of the arc set but in this talk we restrict our attention to edges. If each part of the decomposition is a spanning subgraph then we call the decomposition a factorisation and the parts are called factors. Decompositions are especially interesting when the subgraphs induced by each part are pairwise isomo...

متن کامل

Three Types of Inclusions of Innately Transitive Permutation Groups into Wreath Products in Product Action

A permutation group is innately transitive if it has a transitive minimal normal subgroup, and this subgroup is called a plinth. In this paper we study three special types of inclusions of innately transitive permutation groups in wreath products in product action. This is achieved by studying the natural Cartesian decomposition of the underlying set that correspond to the product action of a w...

متن کامل

On imprimitive rank 3 permutation groups

A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor, Liebler, Liebeck and Saxl, this yields a classification of all quasiprimitive rank 3 permutation groups. Our classification is achieved by first classifying imprimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2008